Improved direct-method aided iterative dual-space model completion

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Iterative Null-space Projection Method with Adaptive Thresholding in Sparse Signal Recovery and Matrix Completion

Adaptive thresholding methods have proved to yield high Signal-to-Noise Ratio (SNR) and fast convergence in finding the solution to the Compressed Sensing (CS) problems. Recently, It was observed that the robustness of a class of iterative sparse recovery algorithms such as Iterative Method with Adaptive Thresholding (IMAT) outperforms the well-known LASSO algorithm in terms of reconstruction q...

متن کامل

Direct-method-aided phasing of MAD data.

The direct methods of breaking the phase ambiguity intrinsic in one-wavelength anomalous scattering (OAS) data and MAD phasing are powerful methods in their own rights. In a different context, in addition to their success in phasing OAS data, direct methods can also be useful in the treatment of MAD data. The idea has been tested with the MAD data at 2.5 A resolution from the protein human aden...

متن کامل

An Accelerated Iterative Hard Thresholding Method for Matrix Completion

The matrix completion problem is to reconstruct an unknown matrix with low-rank or approximately low-rank constraints from its partially known samples. Most methods to solve the rank minimization problem are relaxing it to the nuclear norm regularized least squares problem. Recently, there have been some simple and fast algorithms based on hard thresholding operator. In this paper, we propose a...

متن کامل

Iterative Dual Rational Krylov and Iterative SVD-Dual Rational Krylov Model Reduction for Switched Linear Systems

In this paper, we propose two models reduction algorithms for approximation of large-scale linear switched systems. We present at first the iterative dual rational krylov approach, that construct a union of krylov subspaces. The iterative dual rational Krylov is low in cost, numerical efficient but the stability of reduced system is not always guaranteed. In the second part we present, the iter...

متن کامل

Dual Space of a Lattice as the Completion of a Pervin Space - Extended Abstract

The original motivation of this paper, as presented in [15], was to compute the dual space of a lattice of subsets of some free monoid A∗. According to StonePriestley duality, the dual space of a lattice can be identified with the set of its prime filters, but it is not always the simplest way to describe it. Consider for instance the Boolean algebra generated by the sets of the form uA∗, where...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Acta Crystallographica Section A Foundations and Advances

سال: 2014

ISSN: 2053-2733

DOI: 10.1107/s2053273314096673